A pseudorandom bit generator based on arctangent function
نویسندگان
چکیده
منابع مشابه
A Pseudorandom Bit Generator based on Chaotic Coupled Map Lattices
In this paper, we discuss the properties of making a deterministic algorithm suitable to generate a pseudo random sequence of numbers: high value of Kolmogorov-Sinai entropy, high dimensionality of the parent dynamical system, and very large period of the generated sequence. We propose the chaotic coupled map lattices as a pseudo random number generator. We show what chaotic features of the cou...
متن کاملA Pseudorandom Bit Generator Based on Block Upper Triangular Matrices
The popularity of the Web has created a great marketplace for businesses to sell and showcase their products increasing the need for secure Web services such as SSL, TLS or SET. We propose a pseudorandom bit generator that can be used to create a stream cipher directly applicable to these secure systems; it is based on the powers of a block upper triangular matrix achieving great statistical re...
متن کاملPseudorandom Generator Based on Hard Lattice Problem
This paper studies how to construct a pseudorandom generator using hard lattice problems. We use a variation of the classical hard problem Inhomogeneous Small Integer Solution ISIS of lattice, say Inhomogeneous Subset Sum Solution ISSS. ISSS itself is a hash function. Proving the preimage sizes ISSS hash function images are almost the same, we construct a pseudorandom generator using the method...
متن کاملFast Pseudorandom Generator based on Packed Matrices
Pseudorandom generators are a basic foundation of many cryptographic services and information security protocols. We propose a modification of a previously published matricial pseudorandom generator that significantly improves performance and security. The resulting generator is successfully compared to world class standards. Key-Words: Pseudorandom Generator, Stream Ciphers, Binary Matrices, C...
متن کاملCryptanalysis of a Pseudorandom Generator Based on Braid Groups
We show that the decisional version of the Ko-Lee assumption for braid groups put forward by Lee, Lee and Hahn at Crypto 2001 is false, by giving an efficient algorithm that solves (with high probability) the corresponding decisional problem. Our attack immediately applies to the pseudo-random generator and synthesizer proposed by the same authors based on the decisional Ko-Lee assumption, and ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Physics: Conference Series
سال: 2021
ISSN: 1742-6588,1742-6596
DOI: 10.1088/1742-6596/1856/1/012069